Characterization of Boolean Topological Logics Short Form: Boolean Topological Logics
نویسندگان
چکیده
We investigate logics that are derived from topological spaces; such logics were first described by Westmoreland and Schumacher in 1993. Here, we explore the relationship between the logic systems and the topologies used to construct them. Special attention is given to Boolean topological logics. We show a characterization of these
منابع مشابه
Determination of Suitable Areas for underground Dam Construction Using Boolean and Fuzzy Logics in Central Areas of Ardebil Province
In the arid and semi-arid area's rainfall have considerable changes in terms of time and amount that make the water resource management an important issue. In this research, using both Boolean and Fuzzy logic were zoned potentiality suitable areas for construction of underground dams. The study area is located in the central region of Ardabil province with 7461 km2 area and semi-arid climate. F...
متن کاملTitle Fuzzy Topology and Łukasiewicz Logics from the
This paper explores relationships between many-valued logic and fuzzy topology from the viewpoint of duality theory. We first show a fuzzy topological duality for the algebras of Lukasiewicz n-valued logic with truth constants, which generalizes Stone duality for Boolean algebras to the n-valued case via fuzzy topology. Then, based on this duality, we show a fuzzy topological duality for the al...
متن کاملTopological Completeness of First-Order Modal Logics
As McKinsey and Tarski [20] showed, the Stone representation theorem for Boolean algebras extends to algebras with operators to give topological semantics for (classical) propositional modal logic, in which the “necessity” operation is modeled by taking the interior of an arbitrary subset of a topological space. This topological interpretation was recently extended in a natural way to arbitrary...
متن کاملSimple and subdirectly irreducibles bounded distributive lattices with unary operators
Distributive lattices with operators (DLO) are a natural generalization of the notion of Boolean algebras with operators. An operator in a bounded distributive lattice A is a function f : An → A which preserves ∧ (or ∨) in each coordinate. In the last few years these classes of algebras have been actively investigated since they appear as algebraic counterpart of many logics. Some important con...
متن کاملA Topological Constraint Language with Component Counting
A topological constraint language is a formal language whose variables range over certain subsets of topological spaces, and whose nonlogical primitives are interpreted as topological relations and functions taking these subsets as arguments. Thus, topological constraint languages typically allow us to make assertions such as “region V1 touches the boundary of region V2”, “region V3 is connecte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Multiple-Valued Logic and Soft Computing
دوره 12 شماره
صفحات -
تاریخ انتشار 2006